Improved upper bounds in the moving sofa problem
نویسندگان
چکیده
منابع مشابه
Improved upper bounds in the moving sofa problem
The moving sofa problem, posed by L. Moser in 1966, asks for the planar shape of maximal area that can move around a right-angled corner in a hallway of unit width. It is known that a maximal area shape exists, and that its area is at least 2.2195 . . .—the area of an explicit construction found by Gerver in 1992—and at most 2 √ 2 ≈ 2.82, with the lower bound being conjectured as the true value...
متن کاملDifferential equations and exact solutions in the moving sofa problem
The moving sofa problem, posed by L. Moser in 1966, asks for the planar shape of maximal area that can move around a right-angled corner in a hallway of unit width, and is conjectured to have as its solution a complicated shape derived by Gerver in 1992. We extend Gerver’s techniques by deriving a family of six differential equations arising from the area-maximization property. We then use this...
متن کاملImproved upper and lower bounds for the point placement problem
The point placement problem is to determine the positions of a set of n distinct points, P = {p1, p2, p3, . . . , pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points. Each distance query corresponds to an edge in a graph, called point placement graph (ppg), whose vertex set is P . The uniqueness requirement of the placemen...
متن کاملImproved Upper Bounds for the Mixed
|In this paper, we take a new look at the mixed struc-tured singular value problem, a problem nding important applications in robust stability analysis. Several new upper bounds are proposed using a very simple approach which we call the multiplier approach. These new bounds are convex and computable by using linear matrix inequality (LMI) techniques. We show, most importantly, that these upper...
متن کاملImproved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem
Recently, Goldberg proposed a new approach lo the maximum netv.ork flow problem. The approach yields a ver>' simple algorithm nmning in 0{n^) time on n-vertex networks. Incorporation of the dynamic tree data structure of Sleator and Tarjan yields a more complicated algorithm with a running time of 0{rvn log {n^ Im)) on m-arc networks. Ahuja and Orlin developed a variant of Goldberg's algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2018
ISSN: 0001-8708
DOI: 10.1016/j.aim.2018.10.022